Combining partially independent belief functions
نویسندگان
چکیده
The theory of belief functions manages uncertainty and also proposes a set of combination rules to aggregate opinions of several sources. Some combination rules mix evidential information where sources are independent; other rules are suited to combine evidential information held by dependent sources. In this paper we have two main contributions: First we suggest a method to quantify sources’ degree of independence that may guide the choice of the more appropriate set of combination rules. Second, we propose a new combination rule that takes consideration of sources’ degree of independence. The proposed method is illustrated on generated mass functions.
منابع مشابه
Modifiable Combining Functions
Glenn Shafer Prakash P. Shenoy School of Business University of Kansas Lawrence, Kansas 66045 Modifiable combining functions are a synthesis of two general approaches to combining evidence. Be cause they facilitate the acquisition, representation, explanation, and modification of expert knowl edge about combinations of evidence, they are presented as a device for knowledge engineers, not as a...
متن کاملDecision fusion for postal address recognition using belief functions
Combining the outputs from several postal address readers (PARs) is a promising approach for improving the performances of mailing address recognition systems. In this paper, this problem is solved using the Transferable Belief Model, an uncertain reasoning framework based on Dempster-Shafer belief functions. Applying this framework to postal address recognition implies defining the frame of di...
متن کاملBelief functions combination without the assumption of independence of the information sources
This paper considers the problem of combining belief functions obtained from not necessarily independent sources of information. It introduces two combination rules for the situation in which no assumption is made about the dependence of the information sources. These two rules are based on cautious combinations of plausibility and commonality functions, respectively. The paper studies the prop...
متن کاملCombining Classifiers through Triplet-Based Belief Functions
Classifier outputs in the form of continuous values have often been combined using linear sum or stacking, but little is generally known about evidential reasoning methods for combining truncated lists of ordered decisions. In this paper we introduce a novel class-indifferent method for combining such a kind of classifier decisions. Specifically we model each output given by classifiers on new ...
متن کاملThe Cumulative Rule for Belief Fusion
The problem of combining beliefs in the Dempster-Shafer belief theory has attracted considerable attention over the last two decades. The classical Dempster's Rule has often been criticised, and many alternative rules for belief combination have been proposed in the literature. The consensus operator for combining beliefs has nice properties and produces more intuitive results than Dempster's r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Decision Support Systems
دوره 73 شماره
صفحات -
تاریخ انتشار 2015